lattice homomorphism造句
例句與造句
- These frames, together with lattice homomorphisms that respect arbitrary suprema, form a category.
- Let "'Dist "'denote the category of bounded distributive lattices and bounded lattice homomorphisms.
- Given the standard definition of isomorphisms as invertible morphisms, a " lattice isomorphism " is just a bijective lattice homomorphism.
- *PM : complete lattice homomorphism, id = 9241 new !-- WP guess : complete lattice homomorphism-- Status:
- *PM : complete lattice homomorphism, id = 9241 new !-- WP guess : complete lattice homomorphism-- Status:
- It's difficult to find lattice homomorphism in a sentence. 用lattice homomorphism造句挺難的
- The symbol " F " is then a functor from the category of sets to the category of lattices and lattice homomorphisms.
- *PM : example of non-complete lattice homomorphism, id = 9253 new !-- WP guess : example of non-complete lattice homomorphism-- Status:
- *PM : example of non-complete lattice homomorphism, id = 9253 new !-- WP guess : example of non-complete lattice homomorphism-- Status:
- *PM : example of a non-lattice homomorphism, id = 9252 new !-- WP guess : example of a non-lattice homomorphism-- Status:
- *PM : example of a non-lattice homomorphism, id = 9252 new !-- WP guess : example of a non-lattice homomorphism-- Status:
- A morphism of distributive lattices is just a lattice homomorphism as given in the article on lattices, i . e . a function that is compatible with the two lattice operations.
- Similarly, a " lattice endomorphism " is a lattice homomorphism from a lattice to itself, and a " lattice automorphism " is a bijective lattice endomorphism.
- In duality of categories between, on the one hand, the category of finite partial orders and order-preserving maps, and on the other hand the category of finite distributive lattices and bounded lattice homomorphisms.
- With respect to the algebra of subsets, by the above we see that the inverse image function is a lattice homomorphism while the image function is only a semilattice homomorphism ( it does not always preserve intersections ).
- In bounded lattice " L " is called a "'0, 1-simple lattice "'if nonconstant lattice homomorphisms of " L " preserve the identity of its top and bottom elements.
更多例句: 下一頁